Recurrence for cosine series with bounded gaps
نویسندگان
چکیده
منابع مشابه
Bounded gaps between primes
It is proved that lim inf n→∞ (pn+1 − pn) < 7× 10, where pn is the n-th prime. Our method is a refinement of the recent work of Goldston, Pintz and Yildirim on the small gaps between consecutive primes. A major ingredient of the proof is a stronger version of the Bombieri-Vinogradov theorem that is applicable when the moduli are free from large prime divisors only (see Theorem 2 below), but it ...
متن کاملArithmetic Progressions in Sequences with Bounded Gaps
Let G(k;r) denote the smallest positive integer g such that if 1 = a1;a2; : : : ;ag is a strictly increasing sequence of integers with bounded gaps a j+1 a j r, 1 j g 1, then fa1;a2; : : : ;agg contains a k-term arithmetic progression. It is shown that G(k;2) > q k 1 2 4 3 k 1 2 , G(k;3) > 2 k 2 ek (1+ o(1)), G(k;2r 1)> r k 2 ek (1+o(1)), r 2. For positive integers k, r, the van der Waerden num...
متن کاملLooking for Bird Nests: Identifying Stay Points with Bounded Gaps
A stay point of a moving entity is a region in which it spends a significant amount of time. In this paper, we identify all stay points of an entity in a certain time interval, where the entity is allowed to leave the region but it should return within a given time limit. This definition of stay points seems more natural in many applications of trajectory analysis than those that do not limit t...
متن کاملIntegrality Gaps for Bounded Color Matchings
We investigate the performance of two common lift-and-project techniques, the SheraliAdams (SA) and the Balas, Ceria and Cornuéjols (BCC) hierarchies, on the natural linear relaxation of the Bounded Color Matching polyhedron and generalizations. We prove the following unconditional inapproximability results: even a large family of linear programs, generated by an asymptotically linear number of...
متن کاملGaps in Bounded Query Hierarchies
Prior results show that most bounded query hierarchies cannot contain finite gaps. For example, it is known that PSAT (m+1)-tt = PSAT m-tt ) PSAT btt = PSAT m-tt and for all sets A FPA(m+1)-tt = FPAm-tt ) FPAbtt = FPAm-tt PA(m+1)-T = PAm-T ) PAbT = PAm-T FPA(m+1)-T = FPAm-T ) FPAbT = FPAm-T where PAm-tt is the set of languages computable by polynomial-time Turing machines that make m nonadaptiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2010
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm121-2-10